Quantum semi-supervised kernel learning

نویسندگان

چکیده

Quantum machine learning methods have the potential to facilitate using extremely large datasets. While availability of data for training models is steadily increasing, oftentimes it much easier collect feature vectors obtain corresponding labels. One approaches addressing this issue use semi-supervised learning, which leverages not only labeled samples, but also unlabeled vectors. Here, we present a quantum algorithm kernel support vector machines. The uses recent advances in sample-based Hamiltonian simulation extend existing LS-SVM handle term loss. Through theoretical study algorithm’s computational complexity, show that maintains same speedup as fully-supervised LS-SVM.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Semi-supervised deep kernel learning

Deep learning techniques have led to massive improvements in recent years, but large amounts of labeled data are typically required to learn these complex models. We present a semi-supervised approach for training deep models that combines the feature learning capabilities of neural networks with the probabilistic modeling of Gaussian processes and demonstrate that unlabeled data can significan...

متن کامل

Composite Kernel Optimization in Semi-Supervised Metric

Machine-learning solutions to classification, clustering and matching problems critically depend on the adopted metric, which in the past was selected heuristically. In the last decade, it has been demonstrated that an appropriate metric can be learnt from data, resulting in superior performance as compared with traditional metrics. This has recently stimulated a considerable interest in the to...

متن کامل

Spectral Kernel Learning for Semi-Supervised Classification

Typical graph-theoretic approaches for semisupervised classification infer labels of unlabeled instances with the help of graph Laplacians. Founded on the spectral decomposition of the graph Laplacian, this paper learns a kernel matrix via minimizing the leave-one-out classification error on the labeled instances. To this end, an efficient algorithm is presented based on linear programming, res...

متن کامل

Semi-Supervised Kernel PCA

We present three generalisations of Kernel Principal Components Analysis (KPCA) which incorporate knowledge of the class labels of a subset of the data points. The first, MV-KPCA, penalises within class variances similar to Fisher discriminant analysis. The second, LSKPCA is a hybrid of least squares regression and kernel PCA. The final LR-KPCA is an iteratively reweighted version of the previo...

متن کامل

Kernel Selection for Semi-Supervised Kernel Machines

Existing semi-supervised learning methods are mostly based on either the cluster assumption or the manifold assumption. In this paper, we propose an integrated regularization framework for semi-supervised kernel machines by incorporating both the cluster assumption and the manifold assumption. Moreover, it supports kernel learning in the form of kernel selection. The optimization problem involv...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Quantum Machine Intelligence

سال: 2021

ISSN: ['2524-4906', '2524-4914']

DOI: https://doi.org/10.1007/s42484-021-00053-x